On factor left prime factorization problems for multivariate polynomial matrices
نویسندگان
چکیده
This paper is concerned with factor left prime factorization problems for multivariate polynomial matrices without full row rank. We propose a necessary and sufficient condition the existence of factorizations class matrices, then design an algorithm to compute all if they exist. implement on computer algebra system Maple, two examples are given illustrate effectiveness algorithm. The results presented in this also true right column
منابع مشابه
Improved dense multivariate polynomial factorization algorithms
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-quadratic time in the dense size of the input polynomial, and the probabilistic algorithm is softly optimal when the number of variables is at least three. We also investigate the reduction from several to two variable...
متن کاملA New Multichannel Spectral Factorization Algorithm for Parahermitian Polynomial Matrices
Abstract—A novel multichannel spectral factorization algorithm is illustrated in this paper. This new algorithm is based on an iterative method for polynomial eigenvalue decomposition (PEVD) called the second order sequential best rotation (SBR2) algorithm [1]. By using the SBR2 algorithm, multichannel spectral factorization problems are simply broken down to a set of single channel problems wh...
متن کاملPolynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines.
We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection ...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملSelf-Witnessing Polynomial-Time Complexity and Prime Factorization
For a number of computational search problems the existence of a polynomial time algorithm for the problem implies that a polynomial time algorithm for the problem is constructively known Some instances of such self witnessing polynomial time complexity are presented Our main result demonstrates this property for the problem of computing the prime factorization of a positive integer based on a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multidimensional Systems and Signal Processing
سال: 2021
ISSN: ['0923-6082', '1573-0824']
DOI: https://doi.org/10.1007/s11045-021-00768-x